Solving a Freight Railcar Flow Problem Arising in Russia
نویسندگان
چکیده
We consider a variant of the freight railcar flow problem. In this problem, we need 1) to choose a set of transportation demands between stations in a railroad network, and 2) to fulfill these demands by appropriately routing the set of available railcars, while maximizing the total profit. We formulate this problem as a multi-commodity flow problem in a large space-time graph. Three approaches are proposed to solve the Linear Programming relaxation of this formulation: direct solution by an LP solver, a column generation approach based on the path reformulation, and a “column generation for extended formulations” approach. In the latter, the multi-commodity flow formulation is solved iteratively by dynamic generation of arc flow variables. Three approaches have been tested on a set of real-life instances provided by one of the largest freight rail transportation companies in Russia. Instances with up to 10 millions of arc flow variables were solved within minutes of computational time. 1998 ACM Subject Classification G.1.6 Optimization
منابع مشابه
Concurrent Locomotive Assignment and Freight Train Scheduling
The locomotive assignment and the freight train scheduling are important problems in railway transportation. Freight cars are coupled to form a freight rake. The freight rake becomes a train when a locomotive is coupled to it. The locomotive assignment problem assigns locomotives to a set of freight rakes in a way that, with minimum locomotive deadheading time, rake coupling delay and locomotiv...
متن کاملSolving a New Multi-Period Mathematical Model of the Rail-Car Fleet Size and Car Utilization by Simulated Annealing
There is a significant interaction between sizing a fleet of rail cars and its utilization. This paper presents a new multi-period mathematical model and a solution procedure to optimize the rail-car fleet size and freight car allocation, wherein car demands, and travel times, are assumed to be deterministic, and unmet demands are backordered. This problem is considered NP-complete. In other wo...
متن کاملChebyshev finite difference method for solving a mathematical model arising in wastewater treatment plants
The Chebyshev finite difference method is applied to solve a system of two coupled nonlinear Lane-Emden differential equations arising in mathematical modelling of the excess sludge production from wastewater treatment plants. This method is based on a combination of the useful properties of Chebyshev polynomials approximation and finite difference method. The approach consists of reducing the ...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کامل